On theP4-Structure of Perfect Graphs V. Overlap Graphs
نویسندگان
چکیده
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملOn Critically Perfect Graphs on Critically Perfect Graphs
A perfect graph is critical if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, and study operations preserving critical perfectness.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn wing-perfect graphs
An edge in a graph G is called a wing if it is one of the two non-incident edges of an induced P 4 (a path on four vertices) in G. For a graph G its wing-graph W(G) is deened as the graph whose vertices are the wings of G and two vertices in W(G) are connected if the corresponding wings in G belong to the same P 4. We will characterize all graphs whose wing-graph is a cycle. This solves a conje...
متن کاملProgress on perfect graphs
A graph is perfect if for every induced subgraph, the chromatic number is equal to the maximum size of a complete subgraph. The class of perfect graphs is important for several reasons. For instance, many problems of interest in practice but intractable in general can be solved efficiently when restricted to the class of perfect graphs. Also, the question of when a certain class of linear progr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1996
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0042